Random partitioning over a sparse contingency table
نویسندگان
چکیده
منابع مشابه
Random Partitioning over a Sparse Contingency Table
The present article investigates a class of random partitioning distributions of a positive integer. This class is called the Limiting Conditional Compound Poisson (LCCP) distribution and characterized by the law of small numbers. Accordingly the LCCP distribution explains the limiting behavior of counts on a sparse contingency table by the frequencies of frequencies. The LCCP distribution is c...
متن کاملWhat Does a Random Contingency Table Look Like?
Let R = (r1, . . . , rm) and C = (c1, . . . , cn) be positive integer vectors such that r1 + . . .+ rm = c1 + . . .+ cn. We consider the set Σ(R, C) of non-negative m × n integer matrices (contingency tables) with row sums R and column sums C as a finite probability space with the uniform measure. We prove that a random table D ∈ Σ(R, C) is close with high probability to a particular matrix (“t...
متن کاملErgodic Theorems over Sparse Random Subsequences
We prove an L subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of universally L-good sequences nearly as sparse as the set of squares. We extend this theorem to a more general setting of measure-preserving group actions. In addition, we use the same technique to prove an L almost everywhere convergence result for a modulate...
متن کاملErgodic Averages over Sparse Random Subsequences
We prove an L subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of sparser universally L-good sequences than had been previously established. We extend this theorem to a more general setting of ergodic group actions.
متن کاملSTORING A SPARSE TABLE bY
The problem of storing and searching large sparse tables arises in compiling and in other areas of computer science. The standard technique for storing such tables is hashing, but hashing has poor worst-case performance. We consider good worst-case methods for storing a table of n entries, each an integer between 0 and N-l . For dynamic tables, in which look-ups and table additions are intermix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of the Institute of Statistical Mathematics
سال: 2011
ISSN: 0020-3157,1572-9052
DOI: 10.1007/s10463-011-0327-8